A Location Problem with the A-distance in a Competitive Environment
نویسندگان
چکیده
This paper proposes a new location problem of competitive facilities, e.g. shops. In the most studies of competitive facility location, the distance between the facilities and their customers is represented as the Euclid distance. The proposing location problem introduces the A-distance, proposed by Widmayer etc., for representing the situation that the directions which customers can move are given. For solving the formulated facility location problem efficiently, it is shown that the problem is reformulated as a combinatorial optimization problem, and its solving method based on genetic algorithms is proposed. The efficiency of the solving method is shown by applying to several examples of the competitive facility location problems.
منابع مشابه
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملA firefly algorithm for solving competitive location-design problem: a case study
This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملDeveloping a new stochastic competitive model regarding inventory and price
Within the competition in today’s business environment, the design of supply chains becomes more complex than before. This paper deals with the retailer’s location problem when customers choose their vendors, and inventory costs have been considered for retailers. In a competitive location problem, price and location of facilities affect demands of customers; consequently, simultaneous optimiza...
متن کاملVehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach
Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...
متن کامل